Recursions for the Individual Model
نویسندگان
چکیده
Recently, Waldmann considered an algorithm to compute the aggregate claims distribution in the individual life model which is an efficient reformulation of the original exact algorithm of De Pril. In this paper we will show that in practice the approximations as proposed by De Pril are still more efficient than the exact algorithm of Waldmann both in terms of the number of computations required and of the memory occupied by intermediate results. Furthermore we will generalize the algorithm of Waldmann to arbitrary claim amount distributions. We will compare this algorithm with respect to efficiency with the algorithms that were derived by De Pril for this model. It turns out that the approximations of De Pril are most efficient for practical computations.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملThe individual risk model
In the individual risk model, the total claims on a portfolio of insurance contracts is the random variable of interest. The total claims is modelled as the sum of all claims on the individual policies, which are assumed independent. We present several techniques, such as convolution and recursions, to obtain results in this model.
متن کاملRecursions for the individual risk model
In the actuarial literature, several exact and approximative recursive methods have been proposed for calculating the distribution of a sum of mutually independent compound Bernoulli distributed random variables. In this paper, we give an overview of these methods. We compare their performance with the straightforward convolution technique by counting the number of dot operations involved in ea...
متن کاملApplying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
Stochastic models that allow site substitutions, insertions and deletions provide a useful framework for a statistical approach to DNA sequence evolution. Such a model, and recursions to calculate the probability of evolving two sequences, have been known for almost a decade. In this paper we show how the pairwise recursions can be generalised to a 3-sequence tree, and more generally to a r-seq...
متن کاملAnswering N-chain Recursive Queries with Arithmetic
N-chain recursions are important because the majority of single-linear recursions can be compiled to N-chain recursions or so-called bounded recursions [8], which are not recursive at all. It appeared for some time [3, 5] that ALL single linear recursions could be converted to N-chain recursions. Although that is now known [13] to be inaccurate it is still clear that the most popular forms of S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995